Graphs containing triangles are not 3-common
نویسندگان
چکیده
Jagger, S̆t̆ov́ıc̆ek and Thomason [3] defined the class of k-common graphs, and showed among other results that every graph containing K4 as a subgraph is not 2-common. We prove that every graph containing K3 as a subgraph is not 3-common.
منابع مشابه
On Tensor Product of Graphs, Girth and Triangles
The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
متن کاملSimilar Triangles, Another Trace of the Golden Ratio
In this paper we investigate similar triangles which are not congruent but have two pair congruent sides. We show that greatest lower bound of values for similarity ratio of such triangles is golden ratio. For right triangles, we prove that the supremum of values for similarity ratio is the square root of the golden ratio.
متن کاملA Hybrid Sampling Scheme for Triangle Counting
We study the problem of estimating the number of triangles in a graph stream. No streaming algorithm can get sublinear space on all graphs, so methods in this area bound the space in terms of parameters of the input graph such as the maximum number of triangles sharing a single edge. We give a sampling algorithm that is additionally parameterized by the maximum number of triangles sharing a sin...
متن کاملIndependence Number of 2-Factor-Plus-Triangles Graphs
A 2-factor-plus-triangles graph is the union of two 2-regular graphs G1 and G2 with the same vertices, such that G2 consists of disjoint triangles. Let G be the family of such graphs. These include the famous “cycle-plus-triangles” graphs shown to be 3-choosable by Fleischner and Stiebitz. The independence ratio of a graph in G may be less than 1/3; but achieving the minimum value 1/4 requires ...
متن کاملFixed-Orientation Equilateral Triangle Matching of Point Sets
Given a point set P and a class C of geometric objects, GC(P ) is a geometric graph with vertex set P such that any two vertices p and q are adjacent if and only if there is some C ∈ C containing both p and q but no other points from P . We study G5(P ) graphs where 5 is the class of downward equilateral triangles (ie. equilateral triangles with one of their sides parallel to the x-axis and the...
متن کامل